A25 - Number of Routes
https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_y
提出
code: python
h, w = map(int, input().split())
c = list(input().split()) for _ in range(h)
# dphw := chw にいるときの候補数
dp = [None * w for _ in range(h)]
dp00 = 1
print(dp)
解答
code: python
h, w = map(int, input().split())
c = input() for _ in range(h)
# dphw := chw にいるときの候補数
dp = [0 * (w+1) for _ in range(h+1)]
for i in range(h):
for j in range(w):
if i == 0 and j == 0:
dpij = 1
else:
# '#' だったら 0 のまま
dpij = 0
if i >= 1 and ci-1j == '.':
dpij += dpi-1j
if j >= 1 and cij-1 == '.':
dpij += dpij-1
print(dph-1w-1)